Asymptotics for Sparse Exponential Random Graph Models
نویسنده
چکیده
We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain a variational principle for the limiting free energy, an associated concentration of measure, the asymptotics for the mean and variance of the limiting probability distribution, and phase transitions in the edge-triangle model. Similar analysis is done for directed sparse exponential random graph models parametrized by edges and outward stars.
منابع مشابه
Stochastic processes in random graphs
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint distribution of the number of connected components, of the sizes of the giant components, and of the numbers of the excess edges of the giant components. For the sup...
متن کاملOn the giant component of the sparse random graph
This paper provides large deviation asymptotics for the sizes of giant components and the number of components of sparse random graph G(n, c/n).
متن کاملAsymptotic structure and singularities in constrained directed graphs
We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward p-stars. Our models are close cousins of exponential random graph models, in which edges and certain other subgraph densities are controlled by parameters. We find that large graphs have either uniform or bipodal structure. When edge density (resp. p-star density) is fixed and p-star...
متن کاملTractable and Consistent Random Graph Models
We define a general class of network formation models, Statistical Exponential Random Graph Models (SERGMs), that nest standard exponential random graph models (ERGMs) as a special case. We provide the first general results on when these models’ (including ERGMs) parameters estimated from the observation of a single network are consistent (i.e., become accurate as the number of nodes grows). Ne...
متن کاملBayesian inference of exponential random graph models for large social networks
This paper addresses the issue of sampling from the posterior distribution of exponential random graph (ERG) models and other statistical models with intractable normalizing constants. Existing methods based on exact sampling are either infeasible or require very long computing time. We propose and study a general framework of approximate MCMC sampling from these posterior distributions. We als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014